The Probabilistic Method and the Regularity Lemma
نویسنده
چکیده
منابع مشابه
D ec 1 99 6 AN ALGORITHMIC VERSION OF THE BLOW - UP LEMMA
Recently we have developed a new method in graph theory based on the Regularity Lemma. The method is applied to find certain spanning subgraphs in dense graphs. The other main general tool of the method, beside the Regularity Lemma, is the so-called Blow-up Lemma ([24]). This lemma helps to find bounded degree spanning subgraphs in ε-regular graphs. Our original proof of the lemma is not algori...
متن کاملSzemerédi's Regularity Lemma via Martingales
We prove a variant of the abstract probabilistic version of Szemerédi’s regularity lemma, due to Tao, which applies to a number of structures (including graphs, hypergraphs, hypercubes, graphons, and many more) and works for random variables in Lp for any p > 1. Our approach is based on martingale difference sequences.
متن کاملAn algorithmic version of the blow-up lemma
Recently we developed a new method in graph theory based on the regularity lemma. The method is applied to find certain spanning subgraphs in dense graphs. The other main general tool of the method, besides the regularity lemma, is the so-called blow-up Ž w Ž .x lemma Komlos, Sarkozy, and Szemeredi Combinatorica, 17, 109]123 1997 . This lemma ́ ́ ̈ ́ helps to find bounded degree spanning subgraph...
متن کاملTwo Constructions for Tower-Type Lower Bounds of Szemerédi’s Regularity Lemma
The theory of random graph is one of the most important theories in modern combinatorics and theoretical computer science. This naturally leads to the following question: what is the essential property of a random graph? How can we distinguish a given graph from a random graphs? This leads to the development of pseudo-random graph theory (quasi-random graphs). [2] gives a complete survey on pse...
متن کاملThe Removal Lemma for Tournaments
Suppose one needs to change the direction of at least n edges of an n-vertex tournament T , in order to make it H-free. A standard application of the regularity method shows that in this case T contains at least f∗ H( )n h copies of H, where f∗ H is some tower-type function. It has long been observed that many graph/digraph problems become easier when assuming that the host graph is a tournamen...
متن کامل